import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        String str1=sc.nextLine();
        String str2=sc.nextLine();
        if(str1.equals(" ")){
            for(int i=0;i<str2.length();i++){
                System.out.print(str2.charAt(i));
            }
        }else if(str2.equals(" ")){
            for(int i=0;i<str1.length();i++){
                System.out.print(str1.charAt(i));
            }
        }else{
            System.out.println(Integer.parseInt(str1)+Integer.parseInt(str2));
        }

    }
    public static void main2(String[] args) {
        Scanner sc=new Scanner(System.in);
        int q=sc.nextInt();
        int cnt=0;
        while(cnt<q){
            int a=sc.nextInt(),b=sc.nextInt(),c=sc.nextInt();
            int min=min(a,b,c);
            int count=min*2;
            b-=min;
            if(b>=2) {
                count += b - 1;
            }
            System.out.println(count);
            cnt++;
        }
    }
    public static int min(int a,int b,int c){
        int min=a;
        if(min>b) min=b;
        if(min>c) min=c;
        return min;
    }
    public static void main1(String[] args) {
        Scanner scanner = new Scanner(System.in);
        // 读取字符和网格大小
        String[] firstLine = scanner.nextLine().split(" ");
        char replaceChar = firstLine[0].charAt(0);
        int N = Integer.parseInt(firstLine[1]);

        // 读取网格
        char[][] grid = new char[N][N];
        for (int i = 0; i < N; i++) {
            String line = scanner.nextLine();
            for (int j = 0; j < N; j++) {
                grid[i][j] = line.charAt(j);
            }
        }

        // 判断是否对称
        boolean isSymmetric = true;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if (grid[i][j] != grid[N - 1 - i][N - 1 - j]) {
                    isSymmetric = false;
                    break;
                }
            }
            if (!isSymmetric) break;
        }

        // 如果对称，输出提示
        if (isSymmetric) {
            System.out.println("bu yong dao le");
        }

        // 倒置网格并替换字符
        char[][] invertedGrid = new char[N][N];
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                char originalChar = grid[N - 1 - i][N - 1 - j];
                invertedGrid[i][j] = (originalChar == '@') ? replaceChar : ' ';
            }
        }

        // 输出倒置后的网格
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                System.out.print(invertedGrid[i][j]);
            }
            System.out.println();
        }
    }
}